Fast Shortest Path Computation for Solving the Multicommodity Flow Problem
نویسنده
چکیده
For solving the multicommodity flow problems, Lagrangian relaxation based algorithms are fast in practice. The time-consuming part of the algorithms is the shortest path computations in solving the Lagrangian dual problem. We show that an A* search based algorithm is faster than Dijkstra’s algorithm for the shortest path computations when the number of demands is relatively smaller than the size of the network.
منابع مشابه
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different approach to these problems which yields faster and much simpler algorithms. Our approach also allows us to substitute shortest path computations for min-cost flow computations in computing maximum concurrent flow and min...
متن کاملFast and simple approximation schemes for generalized flow
We present fast and simple fully polynomial-time approximation schemes (FPTAS) for generalized versions of maximum flow, multicommodity flow, minimum cost maximum flow, and minimum cost multicommodity flow. We extend and refine fractional packing frameworks introduced in FPTAS’s for traditional multicommodity flow and packing linear programs. Our FPTAS’s dominate the previous best known complex...
متن کاملApproximate Multicommodity Flow for WDM Networks Design
The design of WDM optical networks is an issue for telecom operators since the spreading of this technology will not occur unless enough performance guarantees are provided. Motivated by the quest for efficient algorithms for the Routing and Wavelength Assignment problem (RWA), we address approximations of the fractional multicommodity flow problem which is the central part of a complex randomi...
متن کاملA Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملTwelve: Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems
Two special and important network flow problems are the maximal flow problem and the shortest path problem. Both of these problems can be solved by either the network simplex method of Chapter 9 or the out-of-kilter algorithm of Chapter 11. However, their frequent occurrence in practice and the specialized, more efficient procedures that can be developed for handling these two problems provide ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006